Automatic Optimization of Dynamic Scheduling in Logic Programs
نویسندگان
چکیده
Many modern logic programming languages provide more flexible scheduling than the Prolog traditional left-to-right computation rule. Computation generally also proceeds following some ñxed scheduling rule but certain goals are dynamically "delayed" until their arguments are sufficiently instantiated to allow the cali to run efliciently. This general form of scheduling is referred to as dynamic scheduling. Languages with dynamic scheduling also include constraint programming languages in which constraints which are "too hard" are delayed. In addition, most implementations of concurrent (constraint) programming languages essentially also follow a fixed left to right scheduling rule with suspensión, where such suspensión is controlled by the conditions in the ask guards. In fact, it has been shown that many such languages can be directly translated into (constraint) logic programs with dynamic scheduling with competitive efficiency. As a result, languages with dynamic scheduling are being seen more and more as very useful targets for prototyping or even implementing concurrent languages.
منابع مشابه
Optimization of Logic Programs with Dynamic Scheduling Mar a Garc a De
Dynamic scheduling increases the expressive power of logic programming languages, but also introduces some overhead. In this paper we present two classes of program transformations designed to reduce this additional overhead, while preserving the operational semantics of the original programs , modulo ordering of literals woken at the same time. The rst class of transformations simpliies the de...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملDynamic Cargo Trains Scheduling for Tackling Network Constraints and Costs Emanating from Tardiness and Earliness
This paper aims to develop a multi-objective model for scheduling cargo trains faced by the costs of tardiness and earliness, time limitations, queue priority and limited station lines. Based upon the Islamic Republic of Iran Railway Corporation (IRIRC) regulations, passenger trains enjoy priority over other trains for departure. Therefore, the timetable of cargo trains must be determined based...
متن کاملOptimization of Logic Programs with Dynamic Scheduling
Dynamic scheduling increases the expressive power of logic programming languages, but also introduces some overhead. In this paper we present two classes of program transformations designed to reduce this additional overhead, while preserving the operational semantics of the original programs, modulo ordering of literals woken at the same time. The first class of transformations simplifies the ...
متن کاملSpecialization of Functional Logic Programswith Dynamic Scheduling ?
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays to functional logic programs. We show how to lift the nondeterministic choices from run time to specialization time. We ascertain the conditions under which the original and the transformed program have the same answ...
متن کامل